A congested capacitated location problem with continuous network demand

This paper presents a multi-objective mixed-integer non-linear programming model for congested multiple-server discrete facility location problem with uniformly distributed demands along the network edges. Regarding capacity of each and maximum waiting time threshold, developed aims to determine number locations established facilities their corresponding assigned servers such that traveling distance, time, total cost, lost sales (uncovered customers) are minimized simultaneously. Also, this proposes modified versions some existing heuristics metaheuristic algorithms currently used solve NP-hard problems. Here, memetic algorithm its version called stochastic algorithm, as well add drop solution methods. Computational results comparisons demonstrate although obtained from slightly better, applied could be considered most efficient approach in finding reasonable solutions less required CPU times.